Functional Sequential Treatment Allocation

نویسندگان

چکیده

Consider a setting in which policy maker assigns subjects to treatments, observing each outcome before the next subject arrives. Initially, it is unknown treatment best, but sequential nature of problem permits learning about effectiveness treatments. While multi-armed-bandit literature has shed much light on situation when compares treatments through their mean, less known other targets. This restrictive, because cautious decision may prefer target robust location measure such as quantile or trimmed mean. Furthermore, socio-economic making often requires targeting purpose specific characteristics distribution, its inherent degree inequality, welfare poverty. In present article, we introduce and study algorithms distributional characteristic interest general functional distribution. Minimax expected regret optimality results are obtained within subclass explore-then-commit policies, for unrestricted class all policies. Supplementary materials this article available online.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Allocation With Minimal

This paper describes algorithms for the design of sequential experiments where extensive switching is undesirable. Given an objective function to minimize by sampling between Bernoulli populations, two diierent models are considered. The constraint model optimizes the tradeoo of the maximum number of switches vs. the objective function, while the cost model optimizes the tradeoo for the expecte...

متن کامل

Equilibria in Sequential Allocation

Sequential allocation is a simple mechanism for sharing multiple indivisible items. We study strategic behavior in sequential allocation. In particular, we consider Nash dynamics, as well as the computation and Pareto optimality of pure equilibria, and Stackelberg strategies. We first demonstrate that, even for two agents, better responses can cycle. We then present a linear-time algorithm that...

متن کامل

Complexity of Manipulating Sequential Allocation

Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns and each agents gets the most preferred item that is still available. It has long been known that sequential allocation is not strategyproof. Bouveret and Lang (2014) presented a polynomial-time algorithm to compute a best response of an agent with respect to additively separable utilities and c...

متن کامل

Sequential Allocation with Minimal Switching

This paper describes algorithms for the design of sequential experiments where extensive switching is undesirable. Given an objective function to minimize by sampling between Bernoulli populations, two different models are considered. The constraint model optimizes the tradeoff of the maximum number of switches vs. the objective function, while the cost model optimizes the tradeoff for the expe...

متن کامل

Treatment of Functional Constipation

Childhood constipation is ofton a long_term problem requiring treatment over months or years. There is no single treatment metod for constipation and many children do not respond and continue to have chronic problems. Treatment is consisted of: Disimpaction,Drug adminstration , Diet modilation, and behaverial therapy. It is necessary in all cases that not responding to conventional therapy, un ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 2021

ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']

DOI: https://doi.org/10.1080/01621459.2020.1851236